Indexing expensive functions for efficient multi-dimensional similarity search
نویسندگان
چکیده
منابع مشابه
Indexing the Function: An Efficient Algorithm for Multi-dimensional Search with Expensive Distance Functions
Indexing structures based on space partitioning are powerless because of the well-known “curse of dimensionality”. Linear scan of the data with approximation is more efficient in high dimensional similarity search. However, approaches so far concentrated on reducing I/O, ignored the computation cost. For an expensive distance function such as Lp norm with fractional p, the computation cost beco...
متن کاملMulti-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search
Similarity indices for high-dimensional data are very desirable for building content-based search systems for featurerich data such as audio, images, videos, and other sensor data. Recently, locality sensitive hashing (LSH) and its variations have been proposed as indexing techniques for approximate similarity search. A significant drawback of these approaches is the requirement for a large num...
متن کاملSimilarity Search and Indexing for High-Dimensional Data
Searching by similarity is a critical operation on many systems, and thus has attracted the attention of many disciplines in Computer Sciences, including Computational Geometry, Machine Learning, Multimedia Retrieval and, of course, Databases. To perform efficiently, similarity search requires the support of indexing, which suffers from the infamous "curse of the dimensionality". In this tutori...
متن کاملIndexing Dense Nested Metric Spaces for Efficient Similarity Search
Searching in metric spaces is a very active field since it offers methods for indexing and searching by similarity in collections of unstructured data. These methods select some objects of the collection as reference objects to build the indexes. It has been shown that the way the references are selected affects the search performance, and several algorithms for good reference selection have be...
متن کاملSPY-TEC: An efficient indexing method for similarity search in high-dimensional data spaces
Most of all index structures based on the R-tree have failed to support ecient indexing mechanisms for similarity search in high-dimensional data spaces. This is due to the fact that most of the index structures commonly use balanced split strategy in order to guarantee storage utilization and the shape of queries for similarity search is a hypersphere in high-dimensional spaces. In this paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Knowledge and Information Systems
سال: 2010
ISSN: 0219-1377,0219-3116
DOI: 10.1007/s10115-010-0303-2